package 最大二叉树;

public class Test {
    public static void main(String[] args) {
        int[] nums = {1,2,3};
        Solution solution = new Solution();
        TreeNode root = solution.constructMaximumBinaryTree(nums);
        preOrderTraversal(root);
    }
    public static void preOrderTraversal(TreeNode node) {
        if (node == null) {
            return;
        }
        System.out.print(node.val + " ");
        preOrderTraversal(node.left);
        preOrderTraversal(node.right);
    }
}
